Steklov convexification and a trajectory method for global optimization of multivariate quartic polynomials
نویسندگان
چکیده
منابع مشابه
A convexification method for a class of global optimization problems with applications to reliability optimization
A convexification method is proposed for solving a class of global optimization problems with certain monotone properties. It is shown that this class of problems can be transformed into equivalent concave minimization problems using the proposed convexification schemes. An outer approximation method can then be used to find the global solution of the transformed problem. Applications to mixed-...
متن کاملNewton’s Method for Symmetric Quartic Polynomials
We investigate the parameter plane of the Newton’s method applied to the family of quartic polynomials pa,b(z) = z 4 +az + bz +az+ 1, where a and b are real parameters. We divide the parameter plane (a, b) ∈ R into twelve open and connected regions where p, p′ and p′′ have simple roots. In each of these regions we focus on the study of the Newton’s operator acting on the Riemann sphere.
متن کاملsolution of security constrained unit commitment problem by a new multi-objective optimization method
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
Global Optimization of Polynomials
Recall we were considering the problem minz∈Rn p(z) where p(z) is a degree 2m polynomial such that p(z) = ∑ |α|≤2m pαz , where α = (α1, . . . , αn) is a vector of exponents, using the notation that z = z1 1 . . . z αn n . One equivalent way of expressing this problem is to notice this is the same as minimizing ∫ p(z)μ(dz) over the set of all probability distributions μ and note that it’s equiva...
متن کاملGlobal Optimization with Polynomials
The class of POP (Polynomial Optimization Problems) covers a wide rang of optimization problems such as 0− 1 integer linear and quadratic programs, nonconvex quadratic programs and bilinear matrix inequalities. In this paper, we review some methods on solving the unconstraint case: minimize a real-valued polynomial p(x) : R → R, as well the constraint case: minimize p(x) on a semialgebraic set ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2020
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-020-01536-8